Heuristics and metaheuristics approaches used to solve the Rural Postman Problem: A Comparative Case Study
نویسنده
چکیده
The Rural Postman Problem (RPP) consists of determining a minimum cost tour of a specified arc set of a graph (G=(V,A)) with the particularity that only a subset T (T ⊆ A) of arcs is required to be traversed at least once. The arcs can be directed, undirected or both. This problem appears in a variety of practical contexts like mail, fuel and newspaper deliveries, school bus routing, electrical lines inspection, etc. (Frederickson, 1979). RPP is a NP-hard problem, therefore it has been tackled with some heuristics and metaheuristics due to the difficulty of using exact approaches to global optimality. Up to now, and based in computational results using 26 instances described in Christofides et al. (1981) and in Corberán & Sanchis (1994), an heuristic algorithm for the RPP by Fernández de Córdoba et al. (1998) based on Monte Carlo method had obtained the best results. Baldoquín et al. (2002) developed a hybrid approach based on GRASP and Genetic Algorithm comparable with the above method testing the same instances. In this paper a new hybrid approach based on Simulated Annealing, GRASP and Genetic Algorithm is introduced to solve the Undirected Rural Postman Problem (URPP). We describe the design of a computational experiment to compare the performance of Monte Carlo and the two hybrid method mentioned before, using the same 26 instances. Computational results indicate that the new hybrid approach presented in this paper, and considering the instances tested, outperformed the other methods.
منابع مشابه
New Approaches in Metaheuristics to Solve the Truck Scheduling Problem in a Cross-docking Center
Nowadays, cross-docking is one of the main concepts in supply chain management in which products received to a distribution center by inbound trucks which are directly to lead into outbound trucks with a minimum handling and storage costs as the main cost of a cross-docking system. According to the literature, several metaheuristics and heuristics are attempted to solve this optimization model....
متن کاملA New Hybrid Meta-Heuristics Approach to Solve the Parallel Machine Scheduling Problem Considering Human Resiliency Engineering
This paper proposes a mixed integer programming model to solve a non-identical parallel machine (NIPM) scheduling with sequence-dependent set-up times and human resiliency engineering. The presented mathematical model is formulated to consider human factors including Learning, Teamwork and Awareness. Moreover, processing time of jobs are assumed to be non-deterministic and dependent to their st...
متن کاملHeuristics for the Weighted k-Chinese/rural Postman Problem with a Hint of Fixed Costs with Applications to Urban Snow Removal
We describe a weighted version of the k-Chinese or k-rural postman problem that occurs in the context of snow removal. The problem concerns the questions of which vehicle shall do each task and how the vehicles shall travel between tasks. We also consider different numbers of vehicles, in view of a fixed cost for each vehicle. We describe and discuss heuristic solution approaches, based on usab...
متن کاملHeuristics and metaheuristics for a parallel machine scheduling problem: a computational evaluation
In scheduling theory, minimizing the weighted number of late jobs in the general case (non-equal release dates) is an objective function usually used as a performance indicator. This paper presents several approaches for the NP-Hard parallel machine scheduling problem, including two MILP formulations for exact resolution and various heuristics and metaheuristics to solve large size instances. A...
متن کاملCuckoo search via Levy flights applied to uncapacitated facility location problem
Facility location problem (FLP) is a mathematical way to optimally locate facilities within a set of candidates to satisfy the requirements of a given set of clients. This study addressed the uncapacitated FLP as it assures that the capacity of every selected facility is finite. Thus, even if the demand is not known, which often is the case, in reality, organizations may still be able to take s...
متن کامل